A New Form of Efficient Tree-based Priority Queues for Discrete Event Simulation

A priority queue plays an important role in stochastic discrete event simulations for as much as 40% of a simulation execution time is consumed by the pending event set management. This article describes a new form of tree-based priority queues which employs the demarcation procedure to systematically split a single tree-based priority queue into many smaller trees, each divided by a logical time boundary. These new Demarcate Construction priority queues offer an average speedup of more than twice over the single treebased counterparts and outperform the current expected O(1) Calendar Queue in many scenarios. Their superior performance renders them suitable for many applications such as discrete event simulators.